Matrix compression by common subexpression elimination

Common-subexpression Elimination of Conditional Expressions

Constraint Model Enhancement by Automated Common Subexpression Elimination

The modelling bottleneck in Constraint Modelling prevents the widespread use of Constraint Programming techniques. Automated Constraint Modelling addresses this problem. To enhance automatically generated models, we eliminate common subexpressions during the modelling process, as compilers do when compiling source code. Common subexpression elimination can lead to a dramatic reduction in the si...

An improved common subexpression elimination method for reducing logic operators in FIR filter implementations without increasing logic depth

It is well known that common subexpression elimination techniques minimize the two main cost metrics namely logic operators and logic depths in realizing finite impulse response (FIR) filters. Two classes of common subexpressions occur in the canonic signed digit representation of filter coefficients, called the horizontal and the vertical subexpressions. Previous works have not addressed the t...

Reduced-Complexity Cyclotomic FFTs

In this paper, we first propose a novel common subexpression elimination (CSE) algorithm for matrix-vector multiplications over characteristic-2 fields. As opposed to previously proposed CSE algorithms, which usually focus on complexity savings due to recurrences of subexpressions, our CSE algorithm achieves two types of complexity reductions, differential savings and recurrence savings, by tak...

Common Subexpressions Are Uncommon in Lazy Functional Languages

Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential transparency renders the identification of common subexpressions very simple. More common subexpressions can be recognised because they can be of arbitrary type whereas standard common subexpression elimination only ...